An Improved Parallel DNA Algorithm of 3-SAT
نویسندگان
چکیده
منابع مشابه
An Improved Parallel DNA Algorithm of 3-SAT
There are many large-size and difficult computational problems in mathematics and computer science. For many of these problems, traditional computers cannot handle the mass of data in acceptable timeframes, which we call an NP problem. DNA computing is a means of solving a class of intractable computational problems in which the computing time grows exponentially with problem size. This paper p...
متن کاملA Probabilistic 3-SAT Algorithm Further Improved
In [?], Schöning proposed a simple yet efficient randomized algorithm for solving the kSAT problem. In the case of 3-SAT, the algorithm has an expected running time of poly(n) · (4/3) = O(1.3334) when given a formula F on n variables. This was the up to now best running time known for an algorithm solving 3-SAT. In this paper, we describe an algorithm which improves upon this time bound by comb...
متن کاملAn Improved Local Search Algorithm for 3-SAT
We slightly improve the pruning technique presented in Dantsin et. al. (2002) to obtain an O∗ (1.473n) algorithm for 3-SAT.
متن کاملImproved Bound for the PPSZ/Schöning-Algorithm for 3-SAT
The PPSZ Algorithm presented by Paturi, Pudlak, Saks, and Zane in 1998 has the nice feature that the only satisfying solution of a uniquely satisfiable 3-SAT formula can be found in expected running time at most O(1.3071n). Its bound degenerates when the number of solutions increases. In 1999, Schöning proved an O(1.3334n) bound for 3-SAT. In 2003, Iwama and Tamaki combined both algorithms to y...
متن کاملAn algorithm for 3-SAT problems
This paper presents an algorithm for 3-SAT problems. First, logical formulas are transformed into elementary algebraic formulas. Second, complex trigonometric functions are assigned to the variables in the elementary algebraic formulas, and the sums of the formulas are calculated. The algorithm outputs the number of satisfying assignments. The computational complexity of the algorithm is probab...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Data Science Journal
سال: 2007
ISSN: 1683-1470
DOI: 10.2481/dsj.6.s566